Relative Improvement by Alternative Solutions for Classes of Simple Shortest Path Problems with Uncertain Data — Part I: Strings of Pearls Gn with Unbiased Perturbations
نویسنده
چکیده
For classes of simple shortest path problems we analyze the following situation: We are given a graph G = {V, E,w} and are allowed to provide two solutions A and B which are paths from a given starting node to a given target node. Then we learn about randomly perturbed edge lengths ŵ and are allowed to choose the solution from our pair {A,B} that has the better value with respect to these new lengths ŵ. We analyze how to choose two solutions A and B such that E[min( ∑ e∈A ŵ(e), ∑ e∈B ŵ(e))] is minimal. ∗[email protected]
منابع مشابه
On the Generation of Alternative Solutions for Discrete Optimization Problems with Uncertain Data — An Experimental Analysis of the Penalty Method
The penalty method is a method to generate alternative solutions for many discrete optimization problems. A penalty parameter easily allows to have influence on the difference between optimal and alternative solution. We experimentally test the penalty method for three optimization problems (shortest paths, assignments, travelling salesman) with parameters that change between planning phase and...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملSolving Critical Path Problem in Project Network by a New Enhanced Multi-objective Optimization of Simple Ratio Analysis Approach with Interval Type-2 Fuzzy Sets
Decision making is an important issue in business and project management that assists finding the optimal alternative from a number of feasible alternatives. Decision making requires adequate consideration of uncertainty in projects. In this paper, in order to address uncertainty of project environments, interval type-2 fuzzy sets (IT2FSs) are used. In other words, the rating of each alternativ...
متن کاملApplication of adaptive sampling in fishery part 2: Truncated adaptive cluster sampling designs
There are some experiences that researcher come across quite number of time for very large networks in the initial samples such that they cannot finish the sampling procedure. Two solutions have been proposed and used by marine biologists which we discuss in this article: i) Adaptive cluster sampling based on order statistics with a stopping rule, ii) Restricted adaptive cluster sampling. Until...
متن کامل